package com.faiz.algorithm;

public class MergeTree {
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if (root1 == null && root2 == null) return null;

        if (root1 != null) {
            root1.val += root2 == null ? 0 : root2.val;
        } else {
            root1 = new TreeNode(root2.val);
        }

        root1.left = mergeTrees(root1.left, root2 == null ? null : root2.left);
        root1.right = mergeTrees(root1.right, root2 == null ? null : root2.right);

        return root1;
    }
}
